منابع مشابه
Interactive Learning of Pattern Rankings
Pattern mining provides useful tools for exploratory data analysis. Numerous e cient algorithms exist that are able to discover various types of patterns in large datasets. Unfortunately, the problem of identifying patterns that are genuinely interesting to a particular user remains challenging. Current approaches generally require considerable data mining expertise or e↵ort from the data analy...
متن کاملStructured Learning of Two-Level Dynamic Rankings
For ambiguous queries, conventional retrieval systems are bound by two conflicting goals. On the one hand, they should diversify and strive to present results for as many query intents as possible. On the other hand, they should provide depth for each intent by displaying more than a single result. Since both diversity and depth cannot be achieved simultaneously in the conventional static retri...
متن کاملLimitation of Learning Rankings from Partial Information
1.1. Notations. Let n be the number of elements and Sn be set of all possible n! permutations or rankings of these of n elements. Our interest is in learning non-negative valued functions f defined on Sn, i.e. f : Sn → R+, where R+ = {x ∈ R : x ≥ 0}. The support of f is defined as supp (f) = {σ ∈ Sn : f(σ) 6= 0} . The cardinality of support, | supp (f) | is called the sparsity of f and denoted ...
متن کاملKnowledge - Intensive , Interactive and Efficient Relational Pattern Learning
Ensemble methods like bagging and boosting that combine the decisions of multiple hypotheses are some of the strongest existing machine learning methods. The diversity of the members of an ensemble is known to be an important factor in determining its generalization error. This paper presents a new method for generating ensembles that directly constructs diverse hypotheses using additional arti...
متن کاملMRA-based Statistical Learning from Incomplete Rankings
Statistical analysis of rank data describing preferences over small and variable subsets of a potentially large ensemble of items {1, . . . , n} is a very challenging problem. It is motivated by a wide variety of modern applications, such as recommender systems or search engines. However, very few inference methods have been documented in the literature to learn a ranking model from such incomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Artificial Intelligence Tools
سال: 2014
ISSN: 0218-2130,1793-6349
DOI: 10.1142/s0218213014600264